Partitioning Real-Time Systems on Multiprocessors with Shared Resources

نویسندگان

  • Farhang Nemati
  • Thomas Nolte
  • Moris Behnam
چکیده

In this paper we propose a blocking-aware partitioning algorithm which allocates a task set on a multiprocessor (multi-core) platform in a way that the overall amount of blocking times of tasks are decreased. The algorithm reduces the total utilization which, in turn, has the potential to decrease the total number of required processors (cores). In this paper we evaluate our algorithm and compare it with an existing similar algorithm. The comparison criteria includes both number of schedulable systems as well as processor reduction performance.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Leakage-Aware Energy-Efficient Partitioning for Real-Time Tasks on Multiprocessor Systems

Many embedded real-time systems require to process at high throughput while meeting real-time constraints. To improve performance of systems, multiprocessors have been used widely. Reduction of energy consumption is one of the most important issues in such systems, which operate with limited system resources. From the point of view of real-time scheduling, many approaches which save energy cons...

متن کامل

Semi-Partitioning Technique for Multiprocessor Real-Time Scheduling

A semi-partitioning technique is presented for efficient scheduling of sporadic task systems on multiprocessors. The presented technique performs in the same manner as the traditional partitioning, as long as tasks are successfully partitioned, but a task is allowed to be shared among multiple processors for its execution, if a spare capacity of every individual processor is not enough to accep...

متن کامل

Performance Analysis and Prediction of Processor Scheduling Strategies in Multiprogrammed Shared-Memory Multiprocessors

Small-scale shared-memory multiprocessors are commonly used in a workgroup environment where multiple applications, both parallel and sequential, are executed concurrently while sharing the processors and other system resources. To utilize the processors eeciently, an eeective scheduling strategy is required. In this paper, we use performance data obtained from an SGI multiprocessor to evaluate...

متن کامل

Parallelizing Spatial Databases on Shared-Memory Multiprocessors

Several emerging visualization applications such as ight simulators, distributed interactive simulation (DIS), and virtual reality are using geographic information systems (GISs) for high-delity representation of actual terrains. These applications impose stringent performance and response-time restrictions which require parallelization of the GIS and shared-memory multiprocessors (SMPs) are we...

متن کامل

A Model of Hierarchical Real-Time Virtual Resources

A real-time virtual resource is an abstraction for resource sharing where application task groups must meet timing constraints and knowledge of all the timing requirements may not be available for a global schedulability analysis, such as is the case in the open system environment. In [12], we introduced the notion of a real-time virtual resource which operates at a fraction of the rate of the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010